Eléments de l'association
|  |
List of bibliographic references
Number of relevant bibliographic references: 44.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 001685 | Long Wang [Allemagne] ; Christoph Meinel [Allemagne] ; Chunnian Liu [République populaire de Chine] | Discovering Characteristic Individual Accessing Behaviors in Web Environment |
| 001827 | LONG WANG [Allemagne] ; Christoph Meinel [Allemagne] ; CHUNNIAN LIU [République populaire de Chine] | Discovering characteristic individual accessing behaviors in web environment |
| 001872 | Mohammad Ghasemzadeh [Allemagne] ; Volker Klotz [Allemagne] ; Christoph Meinel [Allemagne] | Embedding Memoization to the Semantic Tree Search for Deciding QBFs |
| 001940 | Long Wang [Allemagne] ; Christoph Meinel [Allemagne] | Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining |
| 001942 | Serge Linckels [Allemagne] ; Christoph Meinel [Allemagne] | Automatic Interpretation of Natural Language for a Multimedia E-learning Tool |
| 001973 | WANJUN HUANG [Allemagne] ; XINHUA ZHANG [Allemagne] ; Uwe Roth [Allemagne] ; Christoph Meinel [Allemagne] | Routing based workflow for construction of distributed applications |
| 001A05 | LONG WANG [Allemagne] ; Christoph Meinel [Allemagne] | Behaviour recovery and complicated pattern definition in web usage mining |
| 001B22 | Wanjun Huang [Allemagne] ; Uwe Roth [Allemagne] ; Christoph Meinel [Allemagne] | A Flexible Middleware Platform with Piped Workflow |
| 001B88 | WANJUN HUANG [Allemagne] ; Uwe Roth [Allemagne] ; Christoph Meinel [Allemagne] | A flexible middleware platform with piped workflow |
| 001B89 | Volker Schillings [Allemagne] ; Christoph Meinel [Allemagne] | tele-TASK: Teleteaching Anywhere Solution Kit |
| 001C25 | Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] ; Arno Wagner [Suisse] | WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms |
| 001C64 | Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne] | Algorithms and Heuristics in VLSI Design |
| 001E40 | Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne] | Data Structures for Boolean Functions BDDs — Foundations and Applications |
| 001F37 | Ernst-Georg Haffner [Allemagne] ; Uwe Roth [Allemagne] ; Andreas Heuer [Allemagne] ; Thomas Engel [Allemagne] ; Christoph Meinel [Allemagne] | What Do Hyperlink-Proposals and Request-Prediction Have in Common? |
| 001F43 | Christoph Meinel [États-Unis, Allemagne] ; Christian Stangier [États-Unis, Allemagne] | Speeding Up Image Computation by Using RTL Information |
| 001F72 | Ernst-Georg Haffner [Allemagne] ; Andreas Heuer [Allemagne] ; Uwe Roth [Allemagne] ; Thomas Engel [Allemagne] ; Christoph Meinel [Allemagne] | Advanced Studies on Link Proposals and Knowledge Retrieval of Hypertexts with CBR |
| 002005 | Christoph Meinel [Allemagne] ; F. Somenzi ; T. Theobald | Linear sifting of decision diagrams and its application in synthesis |
| 002017 | L. Vorwerk [Allemagne] ; F. Losemann [Allemagne] ; T. Engel [Allemagne] ; Christoph Meinel [Allemagne] | Constructing a secure HIPACS with Structured Reporting |
| 002026 | L. Vorwerk [Allemagne] ; T. Engel [Allemagne] ; Christoph Meinel [Allemagne] | A proposal for a combination of compression and encryption |
| 002073 | Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] | Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs |
| 002165 | Christoph Meinel [Allemagne] ; T. Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 002272 | Jochen Bern [Allemagne] ; Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] | The STACS Electronic Submission Service |
| 002278 | Anna Slobodova [États-Unis, Slovaquie] ; Christoph Meinel [Allemagne] | Sample Method for Minimization of OBDDs |
| 002333 | Christoph Meinel [Allemagne] ; C. Stangier [Allemagne] | Speeding up symbolic model checking |
| 002375 | S. Hludov [Allemagne] ; T. Engel [Allemagne] ; Christoph Meinel [Allemagne] | Adaptive compression of DICOM-image data |
| 002396 | Christoph Meinel [Allemagne] ; T. Engel [Allemagne] | Institut für Telematik (Trier) : angewandte Forschung nach Fraunhofer Ideal |
| 002472 | Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 002505 | Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | A reducibility concept for problems defined in terms of ordered binary decision diagrams |
| 002535 | Christoph Meinel [Allemagne] ; A. Slobodov | Unifying theoretical background for some BDD-based data structures |
| 002746 | Christoph Meinel [Allemagne] ; Stephan Waack | The “log rank” conjecture for modular communication complexity |
| 002768 | Jordan Gergov [Allemagne] ; Christoph Meinel [Allemagne] | Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams |
| 002773 | Christoph Meinel [Allemagne] ; S. Waack [Allemagne] | Lower bounds for the majority communication complexity of various graph accessibility problems |
| 002774 | Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne] | Local encoding transformations for optimizing OBDD-representations of finite state machines |
| 002817 | J. Bern [Allemagne] ; Christoph Meinel [Allemagne] ; A. Slobodova [Allemagne] | Some heuristics for generating tree-like FBDD types |
| 002829 | J. Bern [Allemagne] ; Christoph Meinel [Allemagne] ; A. Slobodova [Allemagne] | Global rebuilding of OBDD's avoiding memory requirement maxima |
| 002932 | Christoph Meinel [Allemagne] ; S. Waack [Allemagne] | Separating complexity classes related to bounded alternating ω-branching programs |
| 002951 | Christoph Meinel [Allemagne] ; Stephan Waack | Lower bounds for the majority communication complexity of various graph accessibility problems |
| 002959 | Jochen Bern [Allemagne] ; Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | Global rebuilding of OBDDs avoiding memory requirement maxima |
| 002A44 | Jordan Gergov [Allemagne] ; Christoph Meinel [Allemagne] | On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs |
| 002A96 | Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | On the complexity of constructing optimal ordered binary decision diagrams |
| 002B34 | J. Gergov [Allemagne] ; Christoph Meinel [Allemagne] | Efficient boolean manipulation with OBDD's can be extended to FBDD's |
| 002C09 | Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne] | Separating complexity classes related to bounded alternating Ω-branching programs |
| 002C32 | Jordan Gergov ; Christoph Meinel [Allemagne] | Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs |
| 002C52 | Jordan Gergov ; Christoph Meinel [Allemagne] | Analysis and manipulation of Boolean functions in terms of decision graphs |
| This area was generated with Dilib version V0.6.31. |  |